Activity Planning for Assistive Robots Using Chance-Constrained Stochastic Programming
نویسندگان
چکیده
In this article, we present a framework for planning an activity to be executed with the support of robotic navigation assistant. The two main components are and motion planner. planner composes sequence abstract activities, chosen from given set, synthesize plan. Each is associated point interest in environment probabilistic parameters that depend on plan, which characterized by simulations realistic scenarios. low-level action pass next handled planner, secures physical feasibility actions their compatibility constraints posed user environment. Indeed, final plan must respect optimise his/her satisfaction activity. We show possible model problem as chance constrained optimization along efficient technique find high-quality solutions.
منابع مشابه
SOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کاملOptimal production strategy of bimetallic deposits under technical and economic uncertainties using stochastic chance-constrained programming
In order to catch up with reality, all the macro-decisions related to long-term mining production planning must be made simultaneously and under uncertain conditions of determinant parameters. By taking advantage of the chance-constrained programming, this paper presents a stochastic model to create an optimal strategy for producing bimetallic deposit open-pit mines under certain and uncertain ...
متن کاملA Chance Constrained Integer Programming Model for Open Pit Long-Term Production Planning
The mine production planning defines a sequence of block extraction to obtain the highest NPV under a number of constraints. Mathematical programming has become a widespread approach to optimize production planning, for open pit mines since the 1960s. However, the previous and existing models are found to be limited in their ability to explicitly incorporate the ore grade uncertainty into the p...
متن کاملsome properties for fuzzy chance constrained programming
convexity theory and duality theory are important issues in math- ematical programming. within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. finally,...
متن کاملImproved Integer Programming Approaches for Chance-Constrained Stochastic Programming
The Chance-Constrained Stochastic Programming (CCSP) is one of the models for decision making under uncertainty. In this paper, we consider the special case of the CCSP in which only the righthand side vector is random with a discrete distribution having a finite support. The unit commitment problem is one of the applications of the special case of the CCSP. Existing methods for exactly solving...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Industrial Informatics
سال: 2021
ISSN: ['1551-3203', '1941-0050']
DOI: https://doi.org/10.1109/tii.2020.3012094